%0 Conference Proceedings
%4 sid.inpe.br/banon/2002/11.28.10.53
%2 sid.inpe.br/banon/2002/11.28.10.54
%@doi 10.1109/SIBGRAPI.2001.963031
%T Tracing along an intersection closed loop, when should one stop?
%D 2001
%A Wu, Shin-Ting,
%A Aléssio, Osmar,
%E Borges, Leandro Díbio,
%E Wu, Shin-Ting,
%B Brazilian Symposium on Computer Graphics and Image Processing, 14 (SIBGRAPI)
%C Florianópolis, SC, Brazil
%8 15-18 Oct. 2001
%I IEEE Computer Society
%J Los Alamitos
%P 2-9
%S Proceedings
%1 SBC - Brazilian Computer Society
%K Surface-surface intersections, marching algorithms, closed loops, rotation index.
%X In this paper we present an algorithm for estimating the rotation index of a closed loop from the number of singular points on it. On the basis of this index we also devise a procedure that guarantees to have an arbitrary loop being traced only once. Combining this procedure with a higher-order stepping algorithm, a robust intersection technique is resulted.
%@language en
%3 2-9.pdf
%O The conference was held in Florianópolis, SC, Brazil, from October 15 to 18.